Asynchronous π-calculus & DEL
نویسنده
چکیده
In the full π-calculus by Milner, Parrow and Walker [7] all communication is done by synchronous interaction between processes. In terms of knowledge, this situation has an important consequence, that is, common knowledge is achieved on every interaction. However, many communication scenarios that arise in Computer Science, require to consider asynchronous interaction. A common example can be found on the Consensus Problem, better known as the “Byzantine Generals Problem”[6]. Asynchronous version of π-calculus is a subcalculus of Milner’s one. It was originally proposed by Honda and Tokoro [5] and later also by Boudol [4]. Here we will use the later with the semantics that appear in [3]. Also, asynchronous bisimulation was proposed in [1].
منابع مشابه
The Probabilistic Asynchronous Pi - Calculus
In this dissertation, we consider a distributed implementation of the π-calculus, more precisely, the version of the π-calculus with mixed choice. To this end, we present the probabilistic asynchronous π-calculus, which is an extension of the asynchronous πcalculus enhanced with a notion of random choice. We define an operational semantics which distinguishes between probabilistic choice, made ...
متن کاملComparing the Expressive Power of the Synchronous and the Asynchronous π-calculi
The Asynchronous π-calculus, proposed by Honda and Tokoro (1991) and, independently, by Boudol (1992), is a subset of the π-calculus (Milner et al., 1992) which contains no explicit operators for choice and output-prefixing. The communication mechanism of this calculus, however, is powerful enough to simulate output-prefixing, as shown by Honda and Tokoro (1991) and by Boudol (1992), and input-...
متن کاملComparing The Expressive Power Of The Synchronous And Asynchronous Pi-Calculi
The Asynchronous π-calculus, proposed by Honda and Tokoro (1991) and, independently, by Boudol (1992), is a subset of the π-calculus (Milner et al., 1992) which contains no explicit operators for choice and output-prefixing. The communication mechanism of this calculus, however, is powerful enough to simulate output-prefixing, as shown by Honda and Tokoro (1991) and by Boudol (1992), and input-...
متن کاملOn the asynchronous nature of the asynchronous π-calculus⋆
We address the question of what kind of asynchronous communication is exactly modeled by the asynchronous π-calculus (πa). To this purpose we define a calculus πB where channels are represented explicitly as special buffer processes. The base language for πB is the (synchronous) π-calculus, except that ordinary processes communicate only via buffers. Then we compare this calculus with πa. It tu...
متن کاملOn the Asynchronous Nature of the Asynchronous pi-Calculus
We address the question of what kind of asynchronous communication is exactly modeled by the asynchronous π-calculus (πa). To this purpose we define a calculus πB where channels are represented explicitly as special buffer processes. The base language for πB is the (synchronous) π-calculus, except that ordinary processes communicate only via buffers. Then we compare this calculus with πa. It tu...
متن کامل